Resolution-Based Proof for Multi-Modal Temporal Logics of Knowledge
نویسندگان
چکیده
Temporal logics of knowledge are useful in order to specify complex systems in which agents are both dynamic and have information about their surroundings. We present a resolution method for propositional temporal logic combined with multi-modal S5 and illustrate its use on examples. This paper corrects a previous proposal for resolution in multi-modal temporal logics of knowledge.
منابع مشابه
Practical Proof Methods for Combined Modal and Temporal Logics
For a number of years, temporal and modal logics have been applied outside pure logic in areas such as formal methods, theoretical computer science and artiicial intelligence. In our research we are particularly interested in the use of modal logics in the characterisation of complex components within software systems as intelligent or rational agents. This approach allows the system designer t...
متن کاملA Resolution-Based Proof Method for Temporal Logics of Knowledge and Belief
In this paper we define two logics, KLn and BLn, and present resolutionbased proof methods for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar: it is a temporal logic that contains connectives...
متن کاملResolution for Temporal Logics of Knowledge
A resolution based proof system for a temporal logic of knowledge is presented and shown to be correct. Such logics are useful for proving properties of distributed and multi-agent systems. Examples are given to illustrate the proof system. An extension of the basic system to the multimodal case is given and illustrated using the ‘muddy children problem’.
متن کاملA Mechanisation of Classical Modal Tense Logics Using Isabelle
We present an implementation of an interactive theorem prover for the basic tense logic Kt, and many of its extensions, using the generic proof assistant Isabelle. The novelty of the implementation is that we use a Display Logic formalism of Kt as opposed to a traditional Gentzen system. The prover is intended to assist in meta-theoretical studies of tense logics rather than to be a fast theore...
متن کاملA Cut-free Tableau Calculus for the Logic of Common Knowledge
In this paper we focus on the development of a cut-free finitary tableau calculus with histories for n-agent modal logics with common knowledge (LCK). Thus, we get a proof system where proof-search becomes feasible and we lay the basis for developing a uniform framework for the treatment of the family of logics of common knowledge. Unlike proof calculi based on temporal logics, our calculus giv...
متن کامل